Transversal Hop Domination in Graphs

Let G be a graph. A set S ⊆ V (G) is hop dominating of if for every v ∈ (G)\S, there exists u such that dG(u, v) = 2. The minimum cardinality γh(G) the domination number G. Any γh-set which intersects transversal set. γbh(G) in In this paper, we initiate study domination. First, characterize graphs whose values are either n or − 1, and determine specific some graphs. Next, show positive integers b with ≥ 2 3a, connected graph on vertices a. We also ≤ b, b. Finally, investigate sets join corona two graphs, their corresponding numbers.